A precongruence format for should testing preorder

نویسندگان

  • Xiaowei Huang
  • Li Jiao
  • Weiming Lu
چکیده

Should testing preorder was proposed as a liveness-preserving precongruence for a process algebra except for nondeterministic choice operator [22]. However, this precongruce result cannot be generalized to other languages before carefully proved. In this paper, we show that τDes format is a precongruence format for should testing preorder. A precongruence format guarantees the precongruence of given preorder by imposing syntactic restrictions on languages. The τDes format [24] was suggested to be a precongruence format for testing preorder, which is incomparable with should testing preorder on discriminative power. Also, we look into its applications on ACP language.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Language preorder as a precongruence

Groote and Vaandrager introduced the tyft format, which is a congruence format for strong bisimulation equivalence. This article proposes additional syntactic requirements on the tyft format, extended with predicates, to obtain a precongruence format for language preorder.

متن کامل

Precongruence Formats for Decorated Trace Preorders

This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin’s structural approach. For several preorders in the linear time – branching time spectrum a format is given, as general as possible, such that this preorder is a precon...

متن کامل

On Full Abstractness for Fair Testing

Fair-testing preorders were introduced in 13, 3] in order to overcome diiculties that traditional testing/failures preorders have in tackling divergent behavior. This paper establishes the appropriateness and \optimality" of the fair-must precongruence by proving that it is the coarsest precongruence respecting a natural notion of observable behavior (maximal traces) under a non-catastrophic in...

متن کامل

Syntactic Formats for Free An Abstract Approach to Process Equivalence

A framework of Plotkin and Turi’s, originally aimed at providing an abstract notion of bisimulation, is modified to cover other operational equivalences and preorders. Combined with bialgebraic methods, it yields a technique for the derivation of syntactic formats for transition system specifications which guarantee operational preorders to be precongruences. The technique is applied to the tra...

متن کامل

Universit at Augsburg Modular Construction of Fast Asynchronous Systems Modular Construction of Fast Asynchronous Systems

A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case eeciency of asynchronous systems using dense time, and it is shown that one can equivalently use discrete time. The resulting testing-preorder is characterized with some kind of refusal traces. Furthermore, the testing-preorder is reened to a precongruence for standard operators known from process a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Algebr. Program.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2010